Constraint-based probabilistic modeling for statistical abduction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Inference and Probabilistic Modeling for Constraint-Based NLP

In this paper we present a probabilistic model for constraint-based grammars and a method for estimating the parameters of such models from incomplete, i.e., unparsed data. Whereas methods exist to estimate the parameters of probabilistic context-free grammars from incomplete data ([2]), so far for probabilistic grammars involving context-dependencies only parameter estimation techniques from c...

متن کامل

Statistical Inference and Probabilistic Modelling for Constraint-Based NLP

In this paper we present a probabilistic model for constraint-based grammars and a method for estimating the parameters of such models from incomplete, i.e., unparsed data. Whereas methods exist to estimate the parameters of probabilistic context-free grammars from incomplete data ([2]), so far for probabilistic grammars involving context-dependencies only parameter estimation techniques from c...

متن کامل

Probabilistic Semantics for Cost Based Abduction

Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the assumptions necessary for the proof plus the cost of the rules. We examine existing methods for constructing explanations (proofs), as a minimization problem on a DAG. We then define a probabilistic semantics for the cost...

متن کامل

Statistical Inference for Probabilistic Constraint Logic Programming

Most approaches to probabilistic logic programming deal with deduction systems and xpoint semantics for programming systems with user-speci ed weights attached to the formulae of the language, i.e, the aim is to connect logical inference and probabilistic inference. However, such a user-speci c determination of weights is not reusable and often complex. In various applications, automatic method...

متن کامل

Heyting Domains for Constraint Abduction

We investigate constraint domains in which answers to constraint abduction problems can be represented compactly by a most general answer. We demonstrate several classes of domains which have this property, but show that the property is not compositional.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Machine Learning

سال: 2010

ISSN: 0885-6125,1573-0565

DOI: 10.1007/s10994-010-5206-7